منابع مشابه
Speeding up the Memory
Scalable Flat Cache Only Memory Architectures (Flat COMA) are designed for reduced memory access latencies while minimizing programmer and operating system involvement. Indeed, to keep memory access latencies low, neither the programmer needs to perform clever data placement nor the operating system needs to perform page migration. The hardware automatically replicates the data and migrates it ...
متن کاملSpeeding up the ESG Algorithm
Local search (LS) methods heuristically find a solution for constraint satisfaction problems (CSP). LS starts the search for a solution from a random assignment. LS then examines the neighbours of this assignment to determine a better neighbour valuation to move to. It repeats this process of moving from the current assignment to a better assignment until it finds a solution that satisfies all ...
متن کاملExponentiation : Speeding up the Computation
In lecture notes 9, section 4, we explained how to control the growth in the lengths of numbers when computing me mod n, for numbers m, e, and n which are 1024 bits long. Nevertheless, there is still a problem with the naive exponentiation algorithm that simply multiplies m by itself a total of e − 1 times. Since the value of e is roughly 21024, roughly that many iterations of the main loop wou...
متن کاملSpeeding up snakes
In this paper we summarize new and existing approaches for the semiautomatic image segmentation based on active contour models. In order to replace the manual segmentation of images of the medical research of the Center of Anatomy at the Georg August University of Göttingen we developed a user interface based on snakes. Due to the huge images (sometimes bigger than 100 megapixels) the research ...
متن کاملSpeeding up Dynamic Programming
A number of important computational problems in molecular biology, geology, speech recognition, and other areas, can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, we speed up the computation of several of these recurrences by one or two orders...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Textile Machinary Society
سال: 1961
ISSN: 1883-8715
DOI: 10.4188/transjtmsj1948.14.205